Strong stability and strong quasistability of vector trajectorial problem of lexicographic optimization
نویسندگان
چکیده
Two types of stability of the lexicographic set for the multicri-teria problem on a system of subsets of a finite set with the vector criterion of the most general kind are investigated. Lower bounds of stability radii have been found for the case where Chebyshev norm was defined in the space of vector criterion parameters.
منابع مشابه
Numerical measure of strong stability and strong quasistability in the vector problem of integer linear programming
In this paper we consider a vector integer programming problem with the linear partial criteria. Numerical evaluations of two types of stability of the Pareto set have been found. Usually the stability (quasistability) of a vector optimization problem (see [1-10]) is understood as the property of nonappearance of new optimal solutions (preservation of initial) under small perturbations of the p...
متن کاملStability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
Lower bounds of stability, pseudostability and quasistability radii of lexicographic set in vector combinatorial problem on systems of subsets of finite set with partial criteria of more general kinds have been found. Many specialists are engaged in study of stability of discrete optimization problems to perturbations of their parameters (see [1-3]). Need for investigation of stability of optim...
متن کاملOn quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic preference relation between them. Quasistability of the problem is investigated. This type of stability is a discrete analog of Hausdorff lower semi-co...
متن کاملOn quasistability of a vector combinatorial problem with Σ-MINMAX and Σ-MINMIN partial criteria
We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem) with non-linear partial criteria is in focus...
متن کاملMeasure of stability of a Pareto optimal solution to a vector integer programming problem with fixed surcharges in the l1 and l∞ metrics
In this paper we consider a vector integer programming problem with Pareto principle of optimality for the case where partial criteria belong to the class of separable piecewise linear functions. The limit level of the initial data’s perturbations in the space of vector criteria parameters with norms l1 and l∞, preserved Pareto optimality of the solutions is investigated. Formulas of the quasis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 6 شماره
صفحات -
تاریخ انتشار 1998